G-CORE: A Core for Future Graph Query Languages
نویسندگان
چکیده
We report on a community eort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as rst-class citizens. Our result is G-CORE, a powerful graph query language design that fullls these goals, and strikes a careful balance between path query expressivity and evaluation complexity.
منابع مشابه
Radish: Compiling Efficient Query Plans for Distributed Shared Memory
We present Radish, a query compiler that generates distributed programs. Recent efforts have shown that compiling queries to machine code for a single-core can remove iterator and control overhead for significant performance gains. So far, systems that generate distributed programs only compile plans for single processors and stitch them together with messaging. In this paper, we describe an ap...
متن کاملThree Graceful Operations
A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of G and K2 , and the disjoint union of G a...
متن کاملکاربست واژگان پایه برای دانش‌آموزان با نیازهای ویژه
Background: Core vocabulary is one of the appealing subjects in special education. In this study, some researches related to core vocabulary is reviewed. Then, utilization of core vocabulary for students with special needs is elaborated. Method: The research is descriptive-analytic. Researches on Farsi indexed since 1973 in Scientific Information Database, The Comprehensive Portal of Human S...
متن کاملAg/Pt Core-Shell Nanoparticles on Graphene Nanocomposite for Effective Anodic Fuels Electro-oxidation
The nanocomposite consists of the Ag as a core and Pt as shell on the surface of graphene nanosheets (Ag/Pt-G) was synthesized with a simple method and used as a novel electrochemical platform for an efficient catalyst for oxidation of the ethanol, methanol and formic acid. The morphology and electrochemical properties of Ag/Pt-G nanocomposite were investigated by TEM, X-ray diffraction, and vo...
متن کاملیک الگوریتم خطی برای مساله ی پیداکردن هسته ی درخت های بازه ای وزندار
In this paper we consider the problem of finding a core of weighted interval trees. A core of an interval graph is a path contains some intervals of graph so that the sum of distances from all intervals to this path is minimized. We show that intervals on core of a tree should be maximal, then a linear time algorithm is presented to find the core of interval trees
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.01550 شماره
صفحات -
تاریخ انتشار 2017